Data sending method and apparatus

ABSTRACT

The method includes code block segmentation is performed on a physical layer source data packet, to be sent, having a length of K s  bits, and channel coding is performed on each code block obtained by segmentation, to obtain C s  error-corrected and coded source data sub-packets having lengths of K c  bits; packet coding is performed on the error-corrected and coded source data sub-packets, to obtain C p  check data sub-packets; K i  codeword bits are selected from the i th  sub-packet in C s  source data sub-packets, K j  codeword bits are selected from the j th  sub-packet in the C p  check data sub-packets, all the selected bits are cascaded together to form a sequence having a length of formula (I), i=0, 1, . . . , C s −1, j=0, 1, . . . , C p −1, and the sequence is sent, herein K s , C s  and K c  are integers greater than 1, and C p , K i  and K j  are integers greater than or equal to 0.

TECHNICAL FIELD

The present disclosure relates to the field of communications, and moreparticularly to a data sending method and apparatus.

BACKGROUND

The objective of channel coding is to fight against various noises andinterferences in a transmission process. Usually, the system can beendowed with an ability to automatically correct an error by manuallyadding redundant information, thereby ensuring the reliability ofdigital transmission. A Turbo code is one of the optimal Forward ErrorCorrection (FEC) codes accepted at present, and is widely adopted inmany standard protocols as a channel coding solution for data servicetransmission. Moreover, with the increase of decoding iterations, thedecoding error-correcting performance will be continuously perfected.The Turbo codes commonly used at present include binary Turbo codes anddual-binary tail-biting Turbo codes.

Rate matching processing is a very key technology after channel coding.The objective thereof is to repeat or puncture, under the control of analgorithm, codeword bits subjected to channel coding, so as to ensurethat data bit lengths after rate matching are matched with allocatedphysical channel resources. At present, there are mainly two ratematching algorithms: a 3^(rd) Generation Partnership Project (3GPP) R6rate matching algorithm and a Circular Buffer Rate Matching (CBRM)algorithm. Herein, the CBRM algorithm is a simple algorithm capable ofgenerating an excellent pattern puncturing performance, and this ratematching algorithm is adopted in a majority of communication systemssuch as 3GPP2 series standards, IEEE802.16e standards and 3GPP Long-TermEvolution (LTE).

In the CBRM algorithm, under the condition that the code rate is ⅓,codeword bits output by Turbo coding will be separated into three databit streams through separation of bits: a system bit stream, a firstcheck bit stream and a second check bit stream. The above-mentioned databit streams are re-arranged respectively by using a block interleaver,this processing process usually being called as intra-blockinterleaving. Then, in an output buffer, re-arranged system bits are putat a starting position, and thereafter, two re-arranged check bitstreams are placed in a staggered manner, called as inter-blockinterleaving.

Moreover, in this processing process, Ndata coding bits may be selectedas output of CBRM according to a desired output code rate. CBRM readsout Ndata coding bits from a certain specified starting position fromthe output buffer, called as bit selection. In general, the selectedbits for transmission may be read out from any position in the buffer.After the last bit of a circular buffer area is read, the next bit datais the first bit position data of the circular buffer area. So, the ratematching based on circular buffer (puncture or repetition) may beimplemented by using a simple method. Circular buffer also has theadvantages of flexibility and granularity as for a Hybrid AutomaticRepeat Request (HARQ) operation to be described below.

An HARQ is an important link adaptation technology in a digitalcommunication system. This technology functionally refers to that: areceiving end decodes an HARQ data packet received thereby, feeds an ACKsignal back to a sending end if decoding corrects, and informs thesending end to send a new HARQ data packet; and the receiving end feedsan NACK signal back to the sending end if decoding fails, and requeststhe sending end to re-send an HARQ data packet. The receiving endperforms Incremental Redundancy (IR) or Chase combined decoding on datapackets repeated for many times, so the decoding success probability maybe improved, and the requirement of high reliability on linktransmission is met.

Under an HARQ mode, different positions may be specified in a circularbuffer to serve as read starting positions of an HARQ data packettransmitted at each time. A definition of a Redundancy Version (RV)determines a plurality of read starting positions of the HARQ datapacket in the circular buffer, and the value of the RV will determinespecific read starting positions of the HARQ data packet transmitted atthis time in the circular buffer.

For example, in LTE, the RV defines a starting point of the circularbuffer for selecting a segment of codewords to generate a current HARQpacket. If there are four RVs, four positions are evenly marked in thecircular buffer from left to right in correspondence to the RVs 0, 1, 2and 3. More specific descriptions may refer to proposals and standardsfor virtual CBRM of LTE, which will not be elaborated herein.

During data transmission on a network or a communication channel, datais divided into data packets for transmission. In order to improve thereliability of data transmission, an error-correcting mechanism usuallyneeds to be provided by using a network protocol or coding. For example,during the data transmission on the internet, it is necessary toreliably transmit the data by using an error check retransmissionmechanism provided by a Transmission Control Protocol (TCP). That is,when loss of data packets is detected, a sender is informed ofresending. In a communication system, a Media Access Control (MAC) layersupports an ARQ mechanism, and if the data packets are wronglytransmitted, this mechanism also ensures reliable transmission byrepeatedly sending the data packets.

During data transmission in a multimedia broadcast channel, because aone-way channel is used and data is sent by using a one-to-manybroadcast/multicast mode, the receiving end is not allowed to feed backdata packet loss and error information to the sending end, and theabove-mentioned error check retransmission mechanism cannot be used.Under this condition, the data packet needs to perform Forward ErrorCorrection (FEC) coding before sending, and in this case, a raptor codeis mainly used.

The inventor of the present disclosure discovers that a priorcommunication system has the following problems.

As for a future HARQ-supporting communication system (e.g., a fifthmobile communication system), main scenarios and demands of 5G includeDevice-to-Device (D2D) communication, internet-of-things communication(MCP), Ultra-Dense Network (UDN) communication, Mobile Network (MN)communication, and ultra-reliable (UN) communication. In order to meetnew 5G demands, a future 5G link enhancement technology needs to satisfylow-delay and high-throughput characteristics, so how to reduce a repeatcount or repeat delay of an HARQ for a future communication systemsupporting the HARQ is a problem to be solved.

As for a future communication system not supporting the HARQ (e.g.,future Wireless Local Area Network (WLAN) system), a target Block ErrorRatio (BLER) of a physical layer data packet cannot be too low and isrequired to be 10⁻¹, at least. If a data packet needs to be decomposedinto a great number of coded blocks, the error rate of each coded block(BCER) is often high in requirement, and when the number N of codeblocks is large (e.g., N is greater than or equal to 10), if the targetBLER of the physical layer data packet is less than 0.5, the BLER isabout equal to N*BCER. Hence, in order to achieve the target BLER, a lowcoded block target BCER is needed, and the system needs to give a greatsignal to noise ratio. Particularly, the system efficiency will beobviously limited under poorer channel conditions. So, how to reduce thetarget BCER of each coded block for the future communication system notsupporting the HARQ is a problem to be solved.

An existing broadcast and multicast communication system (e.g., a DVBsystem and a 3GPP Multimedia Broadcast Multicast System (MBMS))introduces a Raptor code or a Fountain code, and this erasure code ismainly applied to a long code instead of an optimal code, and as long asthe code length is greatest, the code has the performance approachingthe performance of the optimal code. Under the condition that the numberof data packets is small (e.g., less than 200), how to design aneffective performance-optimal and complexity-minimum coding solution isa problem to be solved.

In addition, packaging coding may be considered to be used duringmulti-path (including multi-cell and multi-RAT) flexible transmission ofborne data. Under the condition that the number of data packets is small(e.g., less than 100), how to design an effective performance-optimaland complexity-minimum coding solution is a problem to be solved.

In conclusion, a communication system in the related art lacks a codingsolution for a physical layer big data block (Transmission Block (TB))which may be segmented into a great number of coded blocks.

SUMMARY

The embodiment of the present disclosure provides a data sending methodand apparatus, which are intended to at least solve the problem in therelated art that a communication system lacks a coding solution for aphysical layer big data block (TB) which may be segmented into a greatnumber of coded blocks.

According to an embodiment of the present disclosure, a data sendingmethod is provided, which includes that: code block segmentation isperformed on a physical layer source data packet, to be sent, having alength of K_(s) bits, and channel coding is performed on various codeblocks obtained by segmentation, to obtain C_(s) error-corrected andcoded source data sub-packets having lengths of K_(c) bits; packetcoding is performed on the error-corrected and coded source datasub-packets, to obtain C_(p) check data sub-packets; and K_(i) codewordbits are selected from the i^(th) sub-packet in the C_(s) source datasub-packets, K_(j) codeword bits are selected from the j^(th) sub-packetin the C_(p) check data sub-packets, all the selected bits are cascadedtogether to form a sequence having a length of

${G = {{\sum\limits_{i = 0}^{C_{s} - 1}\; K_{i}} + {\sum\limits_{i = 0}^{C_{p} - 1}\; K_{j}}}},$i=0, 1, . . . , C_(s)−1, j=0, 1, . . . , C_(p)−1, and the sequence issent, herein K_(s), C_(s) and K_(c) are integers greater than 1, andC_(p), K_(i) and K_(j) are integers greater than or equal to 0.

In an exemplary embodiment, the step that packet coding is performed onthe error-corrected and coded source data sub-packets to obtain thecheck data sub-packets includes that: under the condition that thenumber C_(s) of code blocks is greater than a preset threshold C₀ and/ora code rate R_(s) of the physical layer source data packet is less thana preset code rate R₀, packet coding is performed on the C_(s) sourcedata sub-packets, to obtain C_(p) K_(c) bit check data sub-packets,herein C₀ and R₀ are positive integers; and under the condition that thenumber C_(s) of code blocks is less than or equal to the presetthreshold C₀ and/or the code rate R_(s) of the physical source datapacket is greater than or equal to the preset code rate R₀, packetcoding is not performed on the C_(s) source data sub-packets or packetcoding is performed only on first K_(d) bits of the C_(s) source datasub-packets, herein K_(d) is a positive integer less than or equal toK_(c); herein the code rate R_(s) of the physical layer source datapacket refers to a length K_(s) of the physical layer source data packetor a ratio of K_(s)−X_(scrc) to a length G of a total codeword bit of,after a whole coding transmission is completed, source data, andX_(scrc) is a length of a Cyclic Redundancy Check code (CRC) of thephysical layer source data packet.

In an exemplary embodiment, K_(d) is a preset value, or determinedaccording to the number C_(s) of code blocks and/or the code rate R_(s)of the physical layer source data packet.

In an exemplary embodiment, the step that packet coding is performed onthe C_(s) source data sub-packets to obtain the C_(p) K_(c) bit checkdata sub-packets includes that: i^(th) bits of all the source datasub-packets form an i^(th) information sequence S_(i) having a length ofC_(s) bits in sequence, and check coding is performed on the informationsequence S_(i), to obtain an i^(th) check sequence P_(i) with D bits, aj^(th) bit of the check sequence P_(i) forming an i^(th) bit of thej^(th) check data sub-packet, herein i=0, 1, 2, . . . , K_(c)−1, j=0, .. . , C_(p)−1, and D is an integer greater than or equal to 1.

In an exemplary embodiment, the check coding includes one of: SingleParity Check (SPC) coding, D-fold single bit parity check code, andD-fold single bit parity check code having different coefficients of amulti-element field GF(q).

In an exemplary embodiment, the step that D-fold single bit parity checkcode is performed on the information sequence S_(i) includes that:binary exclusive OR addition is performed on all input C_(s) informationbits, to obtain a first check bit, and binary exclusive OR addition isperformed on a subset Set_(l) of the C_(s) information bits, to obtainan (l+2)^(th) check bit, herein every two subsets, in various subsets ofthe C_(s) information bits, do not have identical elements, and thenumber of elements in any one subset is less than or equal to ceil(D/2),herein l=0, . . . , D−2.

In an exemplary embodiment, the step that D-fold single bit parity checkcode is performed on the information sequence S_(i) includes that:binary exclusive OR addition is performed on all input C_(s) informationbits, to obtain a first check bit; and l^(th) interweaving is performedon the C_(s) information bits, and binary exclusive OR addition isperformed on first floor(C_(s)/2) or ceil(C_(s)/2) bits, to obtain an(l+2)^(th) check bit, herein every two interweaving modes ofinterweaving at each time are totally different, herein l=0, . . . ,D−2.

In an exemplary embodiment, C₀ is an integer greater than 2, and R₀ is areal number ranging from 0 to 1.

In an exemplary embodiment, the step that the sequence is sent includesthat: the size of K_(i) and the size of K_(j) are determined accordingto one or more of the following parameters: a codeword length K_(c) oferror-correcting coding, a number of times of transmission of an HARQprocess, an RV of an HARQ process, and a length G of a total codewordbit of source data after the whole coding transmission is completed,i=0, 1, . . . , C_(s)−1, j=0, 1, . . . , C_(p)−1; and/or, bit data fromthe source data sub-packets in the sequence is sent according to a modeof M1 modulation order, and bit data from the check data sub-packets inthe sequence is sent according to a mode of M2 modulation order, hereinM2 is greater than or equal to M1, and M1 and M2 are integers greaterthan or equal to 2.

In an exemplary embodiment, before code block segmentation is performed,the physical layer source data packet includes a CRC having a length ofX_(scrc) bits.

In an exemplary embodiment, during code block segmentation, code blocksegmentation is performed on K_(s) bit physical layer source data toobtain C_(s) source data sub-packets, and a code block CRC having anequal length of X_(crc) bits is added to each source data sub-packet,herein X_(crc) is a CRC bit number of each source data sub-packet.

In an exemplary embodiment, if K_(s)<C_(s)*(K_(x)−X_(crc)), before codeblock segmentation is performed on the physical layer source datapacket, to be sent, having the length of K_(s) bits, the physical layersource data packet is filled with C_(s)*(K_(x)−X_(crc))−K_(s)predetermined filling bits, herein K_(x) is a length of each code blockafter a code block CRC is added.

In an exemplary embodiment, the step that channel coding is performed oneach code block obtained by segmentation includes that: channel codinghaving the same code rate and the same coding mode is performed on eachthe code block to obtain codeword data sub-packets having the samelength of K_(c) bits, herein the channel coding mode includes one of:error control coding Reed Muller, convolutional code, turbo code, andLow Density Parity Check (LDPC) coding.

According to a further embodiment of the present disclosure, a datasending apparatus is provided, which includes: a segmentation module,arranged to perform code block segmentation on a physical layer sourcedata packet, to be sent, having a length of K_(s) bits; a channel codingmodule, arranged to perform channel coding on various code blocksobtained by segmentation, to obtain C_(s) error-corrected and codedsource data sub-packets having lengths of K_(c) bits, herein K_(s),C_(s) and K_(c) are integers greater than 1; a packet coding module,arranged to perform packet coding on the error-corrected and codedsource data sub-packets, to obtain C_(p) check data sub-packets; and asending module, arranged to select K_(i) codeword bits from the i^(th)sub-packet in the C_(s) source data sub-packets, select K_(j) codewordbits from the j^(th) sub-packet in the C_(p) check data sub-packets,cascade all the selected bits together to form a sequence having alength of

${G = {{\sum\limits_{i = 0}^{C_{s} - 1}\; K_{i}} + {\sum\limits_{i = 0}^{C_{p} - 1}\; K_{j}}}},$i=0, 1, . . . , C_(s)−1, j=0, 1, . . . , C_(p)−1, and send the sequence,herein C_(p), K_(i) and K_(j) are integers greater than or equal to 0.

In an exemplary embodiment, the packet coding module includes: a firstpacket coding sub-unit, arranged to perform, under the condition thatthe number C_(s) of code blocks is greater than a preset threshold C₀and/or a code rate R_(s) of the physical layer source data packet isless than a preset code rate R₀, packet coding on the K_(c) source datasub-packets, to obtain C_(p) K_(c) bit check data sub-packets, herein C₀and R₀ are positive integers; and a second packet coding unit, arrangedto not perform, under the condition that the number C_(s) of code blocksis less than or equal to the preset threshold C₀ and/or the code rateR_(s) of the physical layer source data packet is greater than or equalto the preset code rate R₀, packet coding on the C_(s) source datasub-packets, or arranged to perform packet coding only on first K_(d)bits of the C_(s) source data sub-packets, herein K_(d) is a positiveinteger less than or equal to K_(c), and K_(d) is a preset value ordetermined according to the number C_(s) of code blocks, herein the coderate R_(s) of the physical layer source data packet refers to a lengthK_(s) of the physical layer source data packet or a ratio ofK_(s)−X_(scrc) to a length G of a total codeword bit of source dataafter the whole coding transmission is completed, and X_(scrc) is alength of a CRC of the physical layer source data packet.

In an exemplary embodiment, the first packet coding unit performs packetcoding on the C_(s) source data sub-packets by means of the followingmodes: forming an i^(th) information sequence S_(i) having a length ofC_(s) bits by i^(th) bits of all the source data sub-packets insequence, and performing check coding on the information sequence S_(i),to obtain an i^(th) check sequence P_(i) with D bits, a j^(th) bit ofthe check sequence P_(i) forming an i^(th) bit of the j^(th) check datasub-packet, herein i=0, 1, 2, . . . , K_(c)−1, j=0, . . . , C_(p)−1, andD is an integer greater than or equal to 1.

In an exemplary embodiment, the first packet coding unit performs checkcoding on the information sequence S_(i) by using one of the followingcoding modes: SPC coding, D-fold single bit parity check code, andD-fold single bit parity check code having different coefficients of amulti-element field GF(q).

In an exemplary embodiment, the first packet coding unit performs D-foldsingle bit parity check coding on the information sequence S_(i)according to the following modes: performing binary exclusive ORaddition on all input C_(s) information bits, to obtain a first checkbit, and performing binary exclusive OR addition on a subset Set_(l) ofthe C_(s) information bits, to obtain an (l+2)^(th) check bit, hereinevery two subsets, in various subsets of the C_(s) information bits, donot have identical elements, and the number of elements in any onesubset is less than or equal to ceil(D/2); or, performing binaryexclusive OR addition on all input C_(s) information bits, to obtain afirst check bit, performing l^(th) interweaving on the C_(s) informationbits, and performing binary exclusive OR addition on firstfloor(C_(s)/2) or ceil(C_(s)/2) bits, to obtain an (l+2)^(th) check bit,herein every two interweaving modes of interweaving at each time aretotally different, herein l=0, . . . , D−2.

In an exemplary embodiment, the sending module sends the sequenceaccording to the following modes: determining the size of K_(i) and thesize of K_(j) according to one or more of the following parameters: acodeword length K_(c) of error-correcting coding, a number of times oftransmission of an HARQ process, an RV of an HARQ process, and a lengthG of a total codeword bit of source data after the whole codingtransmission is completed, i=0, 1, . . . , C_(s)−1, j=0, 1, . . . ,C_(p)−1; and/or, sending bit data from the source data sub-packets inthe sequence according to a mode of M1 modulation order, and sending bitdata from the check data sub-packets in the sequence according to a modeof M2 modulation order, herein M2 is greater than or equal to M1, and M1and M2 are integers greater than or equal to 2.

In an exemplary embodiment, the segmentation module is further arrangedto perform code block segmentation on K_(s) bit physical layer sourcedata to obtain C_(s) source data sub-packets, and then add a code blockCRC having an equal length of X_(crc) bits to each source datasub-packet, herein X_(crc) is a CRC bit number of each source datasub-packet.

According to yet a further embodiment of the present disclosure, a datasending end is provided, which includes the above-mentioned data sendingapparatus.

By means of the embodiment of the present disclosure, code blocksegmentation and channel coding are performed on a physical layer sourcedata packet, and then packaging coding is performed to obtain check datasub-packets. A physical layer big data block (TB) which may be segmentedinto a great number of coded blocks is coded, thereby improving thetransmission performance of the big data block.

BRIEF DESCRIPTION OF DRAWINGS

The accompanying drawings described herein are used to provide furtherunderstanding of the present disclosure, and form a part of the presentapplication. The schematic embodiments and descriptions thereof of thepresent disclosure are used to explain the present disclosure, and donot form improper limits to the present disclosure. In the accompanyingdrawings:

FIG. 1 is a flowchart of a data sending method according to anembodiment of the present disclosure.

FIG. 2 is a flow diagram showing acquisition of an error-corrected andcoded source data sub-packet in an embodiment of the present disclosure.

FIG. 3 is a first performance simulation diagram of a traditionalno-packet coding solution and a packet coding solution in an embodimentof the present disclosure.

FIG. 4 is a second performance simulation diagram of a traditionalno-packet coding solution and a packet coding solution in an embodimentof the present disclosure.

FIG. 5 is a structural diagram of a data sending apparatus according toan embodiment of the present disclosure.

SPECIFIC EMBODIMENTS OF THE PRESENT DISCLOSURE

The present disclosure will be elaborated below with reference to theaccompanying drawings and in conjunction with the embodiments. It isimportant to note that the embodiments in the present application andthe characteristics in the embodiments may be combined withoutconflicts.

According to an embodiment of the present disclosure, a data sendingmethod is provided.

FIG. 1 is a flowchart of a data sending method according to anembodiment of the present disclosure. As shown in FIG. 1, the methodmainly includes Step S102 to Step S106.

In Step S102: Code block segmentation and channel coding are performedon a physical layer source data packet, to be sent, having a length ofK_(s) bits, to obtain C_(s) error-corrected and coded source datasub-packets having lengths of K_(c) bits.

In an alternative implementation mode of the embodiment of the presentdisclosure, in Step S102, before code block segmentation is executed,the physical layer source data packet includes a CRC having a length ofX_(crc) bits.

In an alternative implementation mode of the embodiment of the presentdisclosure, in Step S102, during code block segmentation, code blocksegmentation is performed on K_(s) bit physical layer source data toobtain C_(s) code blocks, and then a code block CRC having an equallength X_(crc) is added to each code block.

In an alternative implementation mode of the embodiment of the presentdisclosure, if K_(s)<C_(s)*(K_(x)−X_(crc)), before code blocksegmentation is performed on a physical layer source data packet, to besent, having the length of K_(s) bits, the physical layer source datapacket is filled with C_(s)*(K_(x)−X_(crc))−K_(s) predetermined fillingbits, herein K_(x) is a length of each code block after a code block CRCis added.

More specifically, as for a fourth mobile communication system, i.e. aLTE system, the physical layer source data packet refers to a TBincluding a Transmission Block CRC; as for a system such as 11ac and11aj of a Wireless Local Area Network WLAN, the physical layer sourcedata packet refers to a Physical layer Service Data Unit (PSDU) datapacket; and as for a Worldwide Interoperability for Microwave Access(WIMAX) system, the physical layer source data packet refers to burst.

In an alternative implementation mode of the embodiment of the presentdisclosure, in Step S102, during channel coding on each segmented codeblock, channel coding having the same code rate and the same coding modeis performed on each code block to obtain codeword data sub-packetshaving the same length of K_(c) bits, herein channel coding is one of:Reed Muller coding, convolutional code, turbo code, and LDPC coding.

FIG. 2 shows a flow diagram of an embodiment for a processing processfrom a physical layer source data packet to an error-corrected sourcedata sub-packet. As shown in FIG. 2, the physical layer source datapacket is segmented into a plurality of code blocks firstly, a CRC isadded into each code block, and then coding is performed by using aturbo coder, so as to obtain a plurality of error-corrected source datasub-packets.

In Step S104: Packet coding is performed on the error-corrected andcoded source data sub-packets, to obtain C_(p) check data sub-packets.

In an alternative implementation mode of the embodiment of the presentdisclosure, if the number C_(s) of code blocks is greater than a fixedthreshold C₀ and/or a code rate R_(s) of the physical layer source datapacket is less than a fixed code rate R₀, packet coding is performed onthe C_(s) source data sub-packets, to obtain C_(p) K_(c) bit check datasub-packets,

herein the code rate R_(s) of the physical layer source data packetrefers to a length K_(s) of the physical layer source data packet or aratio of a length K_(s)−X_(scrc) of a source data packet excluding asource data CRC to a length G of a codeword of source data after thewhole coding transmission is completed, and X_(scrc) is a length of asource data packet CRC.

If the source data packet does not have the source data packet CRC,R_(s)=K_(s)/G.

If the source data packet has the source data packet CRC,R_(s)=(K_(s)−X_(scrc))/G.

In an alternative implementation mode of the embodiment of the presentdisclosure, the step that packet coding is performed on the C_(s) sourcedata sub-packets may include that: i^(th) bits of all first datasub-packet form an i^(th) information sequence S_(i) having a length ofC_(s) bits in sequence, and check coding is performed on the i^(th)information sequence, to obtain an i^(th) check sequence P_(i) with Dbits, a j^(th) bit of the check sequence P_(i) forming an i^(th) bit ofthe j^(th) check sub-packet, herein i=0, 1, 2, . . . , K_(c)−1, j=0, . .. , C_(p)−1. The check coding is at least one of the following coding:SPC coding, D-fold single bit parity check code, and D-fold single bitparity check code having different coefficients of a multi-element fieldGF(q).

In an alternative implementation mode of the embodiment of the presentdisclosure, C₀ may be an integer greater than 2, and R₀ may be a realnumber ranging from 0 to 1.

Herein, if the D-fold single bit parity check code is adopted, checkcoding may be implemented according to the following two modes.

Implementation mode 1: Binary exclusive OR addition is performed on allinput C_(s) information bits, to obtain a first check bit, and binaryexclusive OR addition is performed on a subset Set_(l) of the C_(s)information bits, to obtain an (l+2)^(th) check bit, herein every twosubsets, in various subsets of the C_(s) information bits, do not haveidentical elements, and the number of elements in any one subset is lessthan or equal to ceil(D/2), herein l=0, . . . , D−2.

Implementation mode 2: Binary exclusive OR addition is performed on allinput C_(s) information bits, to obtain a first check bit; and l^(th)interweaving is performed on the C_(s) information bits, and binaryexclusive OR addition is performed on first floor(C_(s)/2) orceil(C_(s)/2) bits, to obtain an (l+2)^(th) check bit, herein every twointerweaving modes of interweaving at each time are totally different,herein l=0, . . . , D−2.

In an alternative implementation mode of the embodiment of the presentdisclosure, if the number C_(s) of code blocks is less than the fixedthreshold C₀, and/or the code rate R_(s) of the physical layer sourcedata packet is greater than the fixed code rate R₀, processing isperformed according to one of the following modes:

Mode 1: Packet coding is not performed on the C_(s) data packets.

Mode 2: Packet coding is performed only on K_(d) bits in the C_(s) datapackets, herein K_(d) is a positive integer less than or equal to C_(s),herein K_(d) is a preset value, or determined according to the numberC_(s) of code blocks and/or the code rate R_(s) of the physical layersource data packet.

In an alternative implementation mode of the embodiment of the presentdisclosure, K_(d) is in direct proportion to code block data C_(s), withincrease of the code block data C_(s), K_(d) increases, and vice versa.

In Step S106: Codeword bits are selected from all the source datasub-packets and all the check data sub-packets, the selected codewordbits are cascaded together to form a sequence, and the sequence is sentfinally. For example, they can be sent to a subsequent processing module(e.g., modulation).

Specifically, K_(i) codeword bits are selected from the i^(th)sub-packet in the C_(s) source data sub-packets, K_(j) codeword bits areselected from the j^(th) sub-packet in the C_(p) data sub-packets, allthe selected bits are cascaded together to form a sequence having alength of

${G = {{\sum\limits_{i = 0}^{C_{s} - 1}\; K_{i}} + {\sum\limits_{i = 0}^{C_{p} - 1}\; K_{j}}}},$and then the sequence is sent,

herein i=0, 1, . . . , C_(s)−1, j=0, 1, . . . , C_(p)−1, K_(s), C_(s)and K_(c) are integers greater than 1, and C_(p), K_(i) and K_(j) areintegers greater than or equal to 0.

In a specific implementation process, in Step S106, during sending ofthe sequence, the size of K_(i) and the size of K_(j) may be determinedaccording to one or more of the following parameters: a codeword lengthK_(c) of error-correcting coding, a number of times of transmission ofan HARQ process, an RV of an HARQ process, and a length G of a totalcodeword bit of source data after the whole coding transmission iscompleted, i=0, 1, . . . , C_(s)−1, j=0, 1, . . . , C_(p)−1. Bit datafrom the source data sub-packets in the sequence may be sent accordingto a mode of M1 modulation order, and bit data from the check datasub-packets in the sequence may be sent according to a mode of M2modulation order, herein M2 is greater than or equal to M1, and M1 andM2 are integers greater than or equal to 2.

The above-mentioned method provided by the embodiment of the presentdisclosure is described below by means of specific embodiments.

Embodiment 1

The present embodiment is illustrated with an IEEE802.11aj system.

In the IEEE802.11aj system, a code rate supported by the system includes½, ⅝, ¾ and 13/16, supported all code lengths are Nldpc=672, in amulti-user occasion, a physical layer source data packet namely aPhysical Service Data Unit PSDU may be segmented into 1 to 200 codeblocks, and in a single-user occasion, a PSDU may be segmented into 1 to1900 code blocks.

In accordance with the above-mentioned method provided by the embodimentof the present disclosure a physical layer PDU with a length of x bitsmay be sent according to the following contents.

1) Filling

The PDU is filled with mod(x, Ka) bits, such that the length of thefilled PDU is Ks=ceil(x/Ka)*Ka bits. Here, Ka=Kb−Kcbcrc=336−8=328 bits,filling bits being put at the headmost position or rearmost position,herein Cs=ceil(x/Ka).

2) Segmentation

The filled PDU having the length of Ks bits may be code-block segmentedinto Cs code blocks, each code block having Ka bits. Here, Ka is theabove-mentioned Kx.

Code block CRCs are added. The same CRC coding is performed on each codeblock to generate CRC bits Kcbcrc=8 bits, and after they are put to thecorresponding code blocks, each code block has Ka=336 bits.

The code blocks are error-corrected and coded. LDPC coding having a coderate of r0=½ is performed on each code block, each code block obtainscoding bits Kc=672 bits, and the first Cs code blocks (source datasub-packets) are obtained.

3) Packet Coding

Packet coding is performed on all coded packets in accordance with thefollowing modes to generate Cp check sub-packets (code block), which areput behind the first Cs code blocks, herein each coding is regarded as adata packet, Cp being greater than or equal to 0.

Packet coding is described below by means of specific examples.

Example a

If Cs=1, packet coding is not performed, Cp=0.

If Cs=2˜10, single bit parity check code packet coding is performed onall the packets to generate Cp=1 check sub-packets, the size of eachcheck sub-packet being Kc.

If Cs>10, D-fold single bit parity check code packet coding is performedon all the packets to generate Cp=D check sub-packets, the size of eachcheck sub-packet being Kc, herein the size of D is directly proportionalto the number C of code blocks.

Example b

If Cs=1 and Rs>0.85, packet coding is not performed, Kp=0.

If Cs=2˜10 and 0.85>=Rs>0.60, single bit parity check code packet codingis performed on all the packets to generate Kp=1 check sub-packets, thesize of check sub-packet being Kc.

If Cs>10 and Rs<=0.6, D-fold single bit parity check code packet codingis performed on all the packets to generate Kp=D check sub-packets, thesize of check sub-packet being Kc, herein the size of D is directlyproportional to the number C of code blocks.

Example c

If Cs=1 or Rs>0.85, packet coding is not performed.

If Cs=2˜4 or 0.85>=Rs>0.60, partial single bit parity check code packetcoding is performed on all the packets to generate Kp=1 checksub-packets, the size of each check sub-packet being Kd, herein the sizeof Kd is directly proportional to the number C of code blocks orinversely proportional to Rs.

If Cs=5˜10 or 0.85>=Rs>0.60, single bit parity check code packet codingis performed on all the packets.

If Cs>10 or Rs<=0.6, D-fold single bit parity check code packet codingis performed on all the packets to generate Kp=D check sub-packets, thesize of each check sub-packet being Kc, herein the size of D is directlyproportional to the number C of code blocks or inversely proportional toRs.

Here, Rs is a code rate after the whole physical layer PDU completes thewhole coding transmission, Cs is number of coded blocks before packetcoding, and Cp is number of check sub-packets (coded block) generatedafter packet coding.

(4) Sending

Firstly, Ki codeword bits are selected from the i^(th) sub-packet in theCs source data sub-packets in sequence, then Kj codeword bits areselected from the j^(th) sub-packet in the Cp data sub-packets, all theselected bits are cascaded together in a sequence of selection to form asequence having a length of

${G = {{\sum\limits_{i = 0}^{C_{s} - 1}\; K_{i}} + {\sum\limits_{i = 0}^{C_{p} - 1}\; K_{j}}}},$and the sequence is sent to the subsequent processing module (e.g.,modulation module), herein i=0, 1, . . . , Cs+Cp−1.

Sending is described below by means of specific embodiments.

Example d

Suppose the lengths of all check sub-packets are Kc, Cp=1,G=Cs·Kc=Cs·672, Ki and Kj may be determined according to the code lengthKc of error-correcting coding, and it is ensured that Rs is still ½. Forexample,

${K_{i} = {{{ceil}\left( \frac{{Cs} \cdot {Kc}}{{Cs} + {Cp}} \right)} = {{611\mspace{14mu} i} = 0}}},\ldots\mspace{14mu},{{{\left( {{Cs} \cdot {Kc}} \right){{mod}\left( {{Cs} + {Cp}} \right)}} - 1} = 0},\ldots\mspace{14mu},9$$K_{i} = {{{{floor}\left( \frac{{Cs} \cdot {Kc}}{{Cs} + {Cp}} \right)}\mspace{14mu} i} = {{other} = {Null}}}$${K_{j} = {{{floor}\left( \frac{{Cs} \cdot {Kc}}{{Cs} + {Cp}} \right)} = {{610\mspace{14mu} j} = 0}}}\mspace{14mu}$

Example e: as for an HARQ Process, Ki and Kj are Obtained According to aRepeat Count

For example, as for an HARQ process of a 3GPP LTE system, codewords arealternatively selected from source data sub-packets for the firsttransmission, if the number of codeword bits of all source datasub-packets are not sufficient, codeword bits are selected from checksub-packets; and codewords are alternatively selected from checksub-packets for the second retransmission, if the number of codewordbits of all source sub-packets are not sufficient, codeword bits areselected from the source data sub-packets.

Example f: as for an HARQ Process, Ki and Kj are Obtained According toan RV

For example, as for an HARQ process of a 3GPP LTE system, codewords arealternatively selected from source data sub-packets when an RV is 0, ifthe number of codeword bits of all source data sub-packets are notsufficient, codeword bits are selected from check sub-packets; andcodewords are alternatively selected from check sub-packets when an RVis 2, if the number of codeword bits of all check sub-packets are notsufficient, codeword bits are selected from the source data sub-packets.

The present embodiment is illustrated with an occasion that the physicallayer source data packet is the PSDU. As for other systems where thephysical layer source data packet is a TB, BURST or the like, operationsare similar to the present embodiment, which will not be specificallyelaborated.

In an ultra-high-speed communication system such as a millimeter wave,microwave and wired communication system, physical layer source data isoften very big, and needs to be segmented into many code blocks.According to the data sending method in the embodiment of the presentdisclosure, big physical layer source data is segmented into a pluralityof coded blocks, each coded block is error-corrected and coded,different methods for coding inter-code block erasure codes are selectedaccording to different preset conditions, packet coding is performed ondifferent code blocks, and a small number of redundant (check) packetsare generated. A contact between the code blocks is established by usingthe small number of extra packets, and the diversity effect between thecode blocks is improved, thereby improving the performance of the wholeTB, greatly improving the whole decoding success rate of physical layersource data blocks and the reliability of data transmission, improvingthe whole BLER performance of physical layer big data blocks (TB, burst,and physical SDU), and reducing the requirement on the BCER.

FIG. 3 and FIG. 4 show performance comparisons between a traditionalno-packet coding solution and a packet coding solution. Simulationresults show that under the condition of keeping an equal spectrumefficiency, the technical solution of the present disclosure achieves agreat performance gain, and shows a great technical progress.

Herein, in order to obtain the simulation results shown in FIG. 3 andFIG. 4, simulation may be performed according to the following steps.

1) After CRCs are added to source data packets, the source data packetsare segmented into information blocks of each code block (LDPC), thelengths of ½ code rate information blocks being 328 bits, and thelengths of 13/16 code rate information blocks being 538 bits.

2) CRCs of 8 bits are added to the information blocks of each code block(LDPC), the LDPCs are coded to obtain corresponding code blocks (C₀, C₁,C₂, . . . , C_(n-1)), and then these code blocks are subjected toexclusive OR operation bit by bit to obtain a packet-coded code blockC_(n).

3) All bits of all the code blocks (LDPC) are selected, and all piecesof the selected code block data are cascaded to form a sequence, and thesequence is sent.

As for FIG. 3, simulation conditions and performance gains include thefollowing content.

Packet Coding: an actual data packet code block number is: 10, 50, 100;in the presence of one exclusive OR packet, sent data packets are: 11,51, 101; Traditional Data Packet: an actual data packet code blocknumber is: 10, 50, 100; an extra packet (672 bits) is averagelycompensated into all data packets, that is, simulation is performedunder the same total data length and total code rate.

Performance Gain (PER=0.01): 0.3 dB for 10, 0.5 dB for 50, and 0.5 dBfor 100.

As for FIG. 4, simulation conditions and performance gains include thefollowing content.

Packet Coding: an actual data packet code block number is: 10, 50, 100;in the presence of one exclusive OR packet, sent data packets are: 11,51, 101; Traditional Data Packet: an actual data packet code blocknumber is: 10, 50, 100; an extra packet (672 bits) is averagelycompensated into all data packets, that is, simulation is performedunder the same total data length and total code rate.

Performance Gain (PER=0.01): 2 dB for 10, 2.1 dB for 50, and 2.1 dB for100.

According to the embodiment of the present disclosure, a data sendingapparatus is also provided. The apparatus is arranged to implement theabove-mentioned data sending method.

FIG. 5 is a structural diagram of a data sending apparatus according toan embodiment of the present disclosure. As shown in FIG. 5, theapparatus mainly includes: a segmentation module 52, arranged to performcode block segmentation on a physical layer source data packet, to besent, having a length of K_(s) bits; a channel coding module 54,arranged to perform channel coding on each code block obtained bysegmentation, to obtain C_(s) error-corrected and coded source datasub-packets having lengths of K_(c) bits, herein K_(s), C_(s) and K_(c)are integers greater than 1; a packet coding module 56, arranged toperform packet coding on the error-corrected and coded source datasub-packets, to obtain C_(p) check data sub-packets; and a sendingmodule 58, arranged to select K_(i) codeword bits from the i^(th)sub-packet in the C_(s) source data sub-packets, select K_(j) codewordbits from the j^(th) sub-packet in the C_(p) check data sub-packets,cascade all the selected bits together to form a sequence having alength of

$G = {{\sum\limits_{i = 0}^{C_{s} - 1}\; K_{i}} + {\sum\limits_{i = 0}^{C_{p} - 1}\; K_{j}}}$(i=0, 1, . . . , C_(s)−1, j=0, 1, . . . , C_(p)−1), and send thesequence, herein C_(p), K_(i) and K_(j) are integers greater than orequal to 0.

In an exemplary embodiment, the segmentation module 52 is furtherarranged to perform code block segmentation on K_(s) bit physical layersource data to obtain C_(s) code blocks, and then add a code block CRChaving an equal length of X_(crc) bits to each code block, hereinX_(crc) is a CRC bit number of each source data sub-packet.

In an exemplary embodiment, the packet coding module 56 may include: afirst packet coding sub-unit, arranged to perform, under the conditionthat the number C_(s) of code blocks is greater than a preset thresholdC₀ and/or a code rate R_(s) of the physical layer source data packet isless than a preset code rate R₀, packet coding on the C_(s) source datasub-packets, to obtain C_(p)K_(c) bit check data sub-packets, herein C₀,R₀ and C_(p) are positive integers; and a second packet coding unit,arranged to not perform, under the condition that the number C_(s) ofcode blocks is less than or equal to the preset threshold C₀ and/or thecode rate R_(s) of the physical layer source data packet is greater thanor equal to the preset code rate R₀, packet coding on the C_(s) sourcedata sub-packets, or arranged to perform packet coding only on firstK_(d) bits of the C_(s) source data sub-packets, herein K_(d) is apositive integer less than or equal to K_(e), and K_(d) is a presetvalue or determined according to the number C_(s) and/or R_(s) of codeblocks, herein the code rate R_(s) of the physical layer source datapacket refers to a length K_(s) of the physical layer source data packetor a ratio of a length K_(s)−X_(scrc) of source data packet notincluding source data CRC to a length G of a total codeword bit ofsource data after the whole coding transmission is completed, andX_(scrc) is a length of a source data packet CRC.

In an exemplary embodiment, the first packet coding unit may performpacket coding on the K_(c) source data sub-packets by means of thefollowing modes: forming an i^(th) information sequence S_(i) having alength of C_(s) bits by i^(th) bits of all the source data sub-packetsin sequence, and performing check coding on the information sequenceS_(i), to obtain an i^(th) check sequence P_(i) with D bits, a j^(th)bit of the check sequence P_(i) forming an i^(th) bit of the j^(th)check data sub-packet, herein i=0, 1, 2, . . . , K_(c)−1, j=0, . . . ,C_(p)−1, and D is an integer greater than or equal to 1.

In an exemplary embodiment, the first packet coding unit may performcheck coding on the information sequence S_(i) by using one of thefollowing coding modes: SPC coding, D-fold single bit parity check code,and D-fold single bit parity check code having different coefficients ofa multi-element field GF(q).

In an exemplary embodiment, the first packet coding unit performs D-foldsingle bit parity check code on the information sequence S_(i) accordingto the following modes: performing binary exclusive OR addition on allinput C_(s) information bits, to obtain a first check bit, andperforming binary exclusive OR addition on a subset Set_(l) of the C_(s)information bits, to obtain an (l+2)^(th) check bit, herein every twosubsets, in various subsets of the C_(s) information bits, do not haveidentical elements, and the number of elements in any one subset is lessthan or equal to ceil(D/2); or, performing binary exclusive OR additionon all input C_(s) information bits, to obtain a first check bit,performing l^(th) interweaving on the C_(s) information bits, andperforming binary exclusive OR addition on first floor(C_(s)/2) orceil(C_(s)/2) bits, to obtain an (l+2)^(th) check bit, herein every twointerweaving modes of interweaving at each time are totally different,herein l=0, . . . , D−2.

In an exemplary embodiment, the sending module sends the sequenceaccording to the following modes: determining the size of K_(i) and thesize of K_(j) according to one or more of the following parameters: acodeword length K_(c) of error-correcting coding, a number of times oftransmission of an HARQ process, an RV of an HARQ process, and a lengthG of a total codeword bit of source data after the whole codingtransmission is completed, i=0, 1, . . . , C_(s)−1, j=0, 1, . . . ,C_(p)−1; and/or, sending bit data from the source data sub-packets inthe sequence according to a mode of M1 modulation order, and sending bitdata from the check data sub-packets in the sequence according to a modeof M2 modulation order, herein M2 is greater than or equal to M1, and M1and M2 are integers greater than or equal to 2.

According to the embodiment of the present disclosure, a data sendingend is also provided, which includes the above-mentioned data sendingapparatus.

By means of the technical solution provided by the embodiment of thepresent disclosure, at a receiving side, a receiving end performsindependent error-correcting and decoding on each data packet (codedblock), when the PER of a source data packet is below 0.5, there is oneor two error packets in most error conditions, and three or more errorpackets occur in least conditions. Then, i^(th) wrong log-likelihoodratio information LLR(i)′ may be provided by using other error packetsfor an i^(th) error packet according to a packet coding relationship,own LLR(i) of the i^(th) error packet and LLR(i)′ are directly added,and then the i^(th) error packet is decoded for one time, i being anindex of an error packet. Code block decoding is performed seriallyunder normal conditions, and data of error code blocks is below 10%generally, so the increase count of code block decoding is also below10%, and therefore the packet coding gain of the present disclosure maybe implemented by increasing the decoding complexity of 10% below.Besides, it is necessary to point out that fold increase of the decodingcomplexity is unacceptable for a future communication system,particularly an ultra-high-speed communication system.

From the above descriptions, it may be seen that in the embodiment ofthe present disclosure, different methods for coding inter-code blockerasure codes are selected according to different preset conditions,packet coding is performed on different code blocks, and a small numberof redundant (check) packets are generated. A contact between the codeblocks is established by using the redundant packets, and the diversityeffect between the code blocks is improved, thereby improving theperformance of the whole TB, and greatly improving the whole decodingsuccess rate of physical layer source data blocks and the reliability ofdata transmission. The BLER performance of physical layer big datablocks (which may be segmented into a great number of code blocks) maybe improved under the same spectrum efficiency, and the requirement onthe BCER is reduced. Simulation may prove that the technical solutionprovided by the embodiment of the present disclosure may obviouslyimprove the performance of a system, thereby improving the overallperformance of the ultra-high-speed communication system.

Apparently, those skilled in the art shall understand that theabove-mentioned all modules or all steps of the present disclosure maybe implemented using a general calculation apparatus, may be centralizedon a single calculation apparatus or may be distributed on a networkcomposed of a plurality of calculation apparatuses. In an exemplaryembodiment, they may be implemented using executable program codes ofthe calculation apparatuses. Thus, they may be stored in a storageapparatus and executed by the calculation apparatuses, the shown ordescribed steps may be executed in a sequence different from thissequence under certain conditions, or they are manufactured into eachintegrated circuit module respectively, or a plurality of modules orsteps therein are manufactured into a single integrated circuit module.Thus, the present disclosure is not limited to a combination of anyspecific hardware and software.

The above is only the embodiments of the present disclosure, and notused to limit the present disclosure. There may be various modificationsand variations in the present disclosure for those skilled in the art.Any modifications, equivalent replacements, improvements and the likemade within the spirit and principle of the present disclosure shallfall within the scope of protection of the present disclosure.

INDUSTRIAL APPLICABILITY

As above, the data sending method and apparatus provided by theembodiment of the present disclosure have the following beneficialeffects. A physical layer big data block (TB) which may be segmentedinto a great number of coded blocks is coded, thereby improving thetransmission performance of the big data block.

What we claim is:
 1. A data sending method suitable for a transmitter sending a source data packet at a physical layer, comprising: performing code block segmentation on the source data packet at the physical layer where the source data packet is to be sent and has a length of Ks bits and performing channel coding on various code blocks obtained by segmentation, to obtain C_(s) error-corrected and coded source data sub-packets having lengths of K_(c) bits; performing packet coding on the error-corrected and coded source data sub-packets, to obtain C_(p) check data sub-packets; and selecting K_(i) codeword bits from a i^(th) sub-packet in the C_(s) source data sub-packets, selecting K_(j) codeword bits from a j^(th) sub-packet in the C_(p) check data sub-packets, cascading all the selected bits together to form a sequence having a length of ${G = {{\sum\limits_{i = 0}^{C_{s} - 1}\; K_{i}} + {\sum\limits_{i = 0}^{C_{p} - 1}\; K_{j}}}},$ i=0, 1, . . . , C_(s)−1, j=0, 1, . . . , C_(p)−1, and sending the sequence, wherein K_(s), C_(s) and K_(c) are integers greater than 1, and C_(p), K_(i) and K_(j) are integers greater than or equal to
 0. 2. The method according to claim 1, wherein performing packet coding on the error-corrected and coded source data sub-packets to obtain the check data sub-packets comprises: under a condition that the number C_(s) of code blocks is greater than a preset threshold C₀ and/or a code rate R_(s) of the source data packet at the physical layer is less than a preset code rate R₀, performing packet coding on the C_(s) source data sub-packets, to obtain C_(p) check data sub-packets with K_(c) bits, wherein C₀ and R₀ are positive integers; and under a condition that the number C_(s) of code blocks is less than or equal to the preset threshold C₀ and/or the code rate R_(s) of the physical source data packet is greater than or equal to the preset code rate R₀, not performing packet coding on the C_(s) source data sub-packets or performing packet coding only on first K_(d) bits of the C_(s) source data sub-packets, wherein K_(d) is a positive integer less than or equal to K_(c), wherein the code rate R_(s) of the source data packet at the physical layer refers to a length K_(s) of the source data packet at the physical layer or a ratio of K_(s)−X_(scrc) to a length G of total codeword bits of, after a whole coding transmission is completed, source data, and X_(scrc) is a length of a Cyclic Redundancy Check, CRC, code of the source data packet at the physical layer.
 3. The method according to claim 2, wherein K_(d) is a preset value, or determined according to the number C_(s) of code blocks and/or the code rate R_(s) of the source data packet at the physical layer.
 4. The method according to claim 2, wherein performing packet coding on the C_(s) source data sub-packets to obtain the C_(p) check data sub-packets with K_(c) bits comprises: forming an i^(th) information sequence S_(i) having a length of C_(s) bits by i^(th) bits of all the source data sub-packets in sequence, and performing check coding on the information sequence S_(i), to obtain an i^(th) check sequence P_(i) with D bits, a j^(th) bit of the check sequence P_(i) forming an i^(th) bit of the j^(th) check data sub-packet, wherein i=0, 1, 2, . . . , K_(c)−1, j=0, C_(p)−1, and D is an integer greater than or equal to
 1. 5. The method according to claim 4, wherein the check coding comprises one of: Single Parity Check, SPC, coding, D-fold single bit parity check code, and D-fold single bit parity check code having different coefficients of a multi-element field GF(q).
 6. The method according to claim 5, wherein performing D-fold single bit parity check code on the information sequence S_(i) comprises: performing a binary exclusive OR addition on all input C_(s) information bits, to obtain a first check bit; and performing the binary exclusive OR addition on a subset Set₁ of the C_(s) information bits, to obtain a (1+2)^(th) check bit, wherein every two subsets, in various subsets of the C_(s) information bits, do not have identical elements, and the number of elements in any one subset is less than or equal to ceil(D/2), wherein l=0, . . . , D−2.
 7. The method according to claim 5, wherein performing D-fold single bit parity check code on the information sequence S_(i) comprises: performing a binary exclusive OR addition on all input C_(s) information bits, to obtain a first check bit; and performing l^(th) interweaving on the C_(s) information bits, and performing the binary exclusive OR addition on first floor(C_(s)/2) or ceil(C_(s)/2) bits, to obtain a (l+2)^(th) check bit, wherein every two interweaving modes of interweaving for each time are totally different, l=0, . . . , D−2.
 8. The method according to claim 2, wherein C₀ is an integer greater than 2, and R₀ is a real number ranging from 0 to
 1. 9. The method according to claim 1, wherein sending the sequence comprises: determining the size of K_(i) and the size of K_(j) according to one or more of the following parameters: a codeword length K_(c) of error-correcting coding, a number of times of transmission of a Hybrid Automatic Repeat Request, HARQ, process, a Redundancy Version, RV, of an HARQ process, and a length G of total codeword bits of, after the whole coding transmission is completed, source data, i=0, 1, . . . , C₅−1, j=0, 1, . . . , C_(p)−1; and/or, sending bit data from the source data sub-packets in the sequence according to a mode of M1 modulation order, and sending bit data from the check data sub-packets in the sequence according to a mode of M2 modulation order, wherein M2 is greater than or equal to M1, and M1 and M2 are integers greater than or equal to
 2. 10. The method according to claim 1, wherein before performing code block segmentation, the source data packet at the physical layer comprises a CRC having a length of X_(scrc) bits.
 11. The method according to claim 1, wherein during code block segmentation, code block segmentation is performed on physical layer source data with K_(s) bits to obtain C_(s) source data sub-packets, and a code block CRC having an equal length of X_(crc) bits is added to each source data sub-packet, wherein X_(crc) is a CRC bit number of each source data sub-packet.
 12. The method according to claim 11, wherein if K_(s)<C_(s)*(K_(x)−X_(crc)), before code block segmentation is performed on the source data packet at the physical layer where the source data packet is to be sent and has a length of Ks bits, source data packet source data packet at the physical layer is filled with C_(s)*(K_(x)−X_(crc))−K_(s) predetermined filling bits, wherein K_(x) is a length of each code block after a code block CRC is added.
 13. The method according to claim 1, wherein performing channel coding on various code blocks obtained by segmentation comprises: channel coding with the same code rate and the same coding mode is performed on each code block to obtain codeword data sub-packets having the same length of K_(c) bits, wherein the channel coding mode comprises one of: Reed Muller, convolutional code, turbo code, and Low Density Parity Check, LDPC.
 14. A transmitter for sending a source data packet at a physical layer, comprising: a segmentation module, arranged to perform code block segmentation on the source data packet at the physical layer where the source data packet is to be sent and has a length of Ks bits; a channel coding module, arranged to perform channel coding on various code blocks obtained by segmentation, to obtain C_(s) error-corrected and coded source data sub-packets having lengths of K_(c) bits, wherein K_(s), C_(s) and K_(c) are integers greater than 1; a packet coding module, arranged to perform packet coding on the error-corrected and coded source data sub-packets, to obtain C_(p) check data sub-packets; and a sending module, arranged to select K_(i) codeword bits from an i^(th) sub-packet in the C_(s) source data sub-packets, select K_(j) codeword bits from a j^(th) sub-packet in the C_(p) check data sub-packets, cascade all the selected bits together to form a sequence having a length of ${G = {{{\sum\limits_{i = 0}^{C_{s} - 1}\; K_{i}} + {\sum\limits_{i = 0}^{C_{p} - 1}\;{K_{j}\mspace{20mu} i}}} = 0}},$ 1, . . . , C_(s)−1, j=0, 1, . . . , C_(p)−1, and send the sequence, wherein C_(p), and K_(j) are integers greater than or equal to
 0. 15. The transmitter according to claim 14, wherein the packet coding module comprises: a first packet coding sub-unit, arranged to perform, under a condition that the number C_(s) of code blocks is greater than a preset threshold C₀ and/or a code rate R_(s) of the source data packet at the physical layer is less than a preset code rate R₀, packet coding on the K_(c) source data sub-packets, to obtain C_(p) check data sub-packets with K_(c) bits, wherein C₀ and R₀ are positive integers; and a second packet coding unit, arranged to not perform, under a condition that the number C_(s) of code blocks is less than or equal to the preset threshold C₀ and/or the code rate R_(s) of the source data packet at the physical layer is greater than or equal to the preset code rate R₀, packet coding on the C_(s) source data sub-packets, or arranged to perform packet coding only on first K_(d) bits of the C_(s) source data sub-packets, wherein K_(d) is a positive integer less than or equal to K_(c), and K_(d) is a preset value or determined according to the number C_(s) of code blocks and/or R_(s), wherein the code rate R_(s) of the source data packet at the physical layer refers to a length K_(s) of the source data packet at the physical layer or a ratio of K_(s)−X_(scrc) to a length G of total codeword bits of, after a whole coding transmission is completed, source data, and X_(scrc) is a length of a Cyclic Redundancy Check, CRC, code of the source data packet at the physical layer.
 16. The transmitter according to claim 15, wherein the first packet coding unit performs packet coding on the C_(s) source data sub-packets by means of the following modes: forming an i^(th) information sequence S_(i) having a length of C_(s) bits by i^(th) bits of all the source data sub-packets in sequence, and performing check coding on the information sequence S_(i), to obtain an i^(th) check sequence P_(i) with D bits, a j^(th) bit of the check sequence P_(i) forming an i^(th) bit of j^(th) check data sub-packet, wherein i=0, 1, 2, . . . , K_(c)−1, j=0, C_(p)−1, and D is an integer greater than or equal to
 1. 17. The transmitter according to claim 16, wherein the first packet coding unit performs check coding on the information sequence S_(i) by using one of the following coding modes: Single Parity Check, SPC, coding, D-fold single bit parity check code, and D-fold single bit parity check code having different coefficients of a multi-element field GF(q).
 18. The transmitter according to claim 17, wherein the first packet coding unit performs check coding on the information sequence S_(i) by using the D-fold single bit parity check code according to following modes: performing a binary exclusive OR addition on all input C_(s) information bits, to obtain a first check bit, and performing the binary exclusive OR addition on a subset Set₁ of the C_(s) information bits, to obtain a (l+2)^(th) check bit, wherein every two subsets, in various subsets of the C_(s) information bits, do not have identical elements, and the number of elements in any one subset is less than or equal to ceil(D/2); or, performing the binary exclusive OR addition on all input C_(s) information bits, to obtain a first check bit, performing l^(th) interweaving on the C_(s) information bits, and performing the binary exclusive OR addition on first floor(C_(s)/2) or ceil(C_(s)/2) bits, to obtain a (l+2)^(th) check bit, wherein every two interweaving modes of interweaving for each time are totally different, wherein 1=0, . . . , D−2.
 19. The transmitter according to claim 14, wherein the sending module sends the sequence according to the following modes: determining the size of K_(i) and the size of K_(j) according to one or more of the following parameters: a codeword length K_(c) of error-correcting coding, a number of times of transmission of a Hybrid Automatic Repeat Request, HARQ, process, a Redundancy Version, RV, of an HARQ process, and a length G of total codeword bits of source data after the whole coding transmission is completed, i=0, 1, . . . , C_(s)−1, j=0, 1, . . . , C_(p)−1; and/or, sending bit data from the source data sub-packets in the sequence according to a mode of M1 modulation order, and sending bit data from the check data sub-packets in the sequence according to a mode of M2 modulation order, wherein M2 is greater than or equal to M1, and M1 and M2 are integers greater than or equal to
 2. 20. The transmitter according to claim 14, wherein the segmentation module is further arranged to perform code block segmentation on physical layer source data with K_(s) bits to obtain C_(s) source data sub-packets, and then add a code block CRC having an equal length of X_(crc) bits to each source data sub-packet, wherein X_(crc) is a CRC bit number of each source data sub-packet. 